منابع مشابه
The 1.5D sieve algorithm
The sieve is a morphological scale-space operator that filters an input signal by removing intensity extrema at a specific scale. In images, this processing can be carried out along a path -the 1D sieveor over a connected graph -the 2D sieve. The 2D version of the sieve generally performs better; it is however much more complex to implement. In this paper we present the 1.5D sieve, a Hamiltonia...
متن کاملThe Quadratic Sieve Factoring Algorithm
The quadrat ic sieve algori thm i s cur ren t ly t h e method of choice t o f a c t o r very l a r g e composite numbers wi th no small fac tors . I n the hands of the Sandia Nat iona l Laboratories team of James Davis and Diane Holdridge, it has held t h e record f o r t h e l a r g e s t hard number f a c t o r e d s i n c e mid-1983. As of t h i s wri t ing, the l a r g e s t number it has c...
متن کاملThe Number Field Sieve Factoring Algorithm
The idea of the NFS is rooted in work by Coppersmith, Odlyzko, and Schroeppel [9], who used the Gaussian integers, Z[i], to compute discrete logarithms in GF (p) in subexponential time. They looked for coprime integers, a and b such that the integer a+bx is smooth for some fixed integer value of x and over some factor base, and such that a+ bi is smooth over some factor base of primes in Z[i]. ...
متن کاملcientParallel Sorting Algorithm Richard
A parallel sorting algorithm is presented for storage-eecient internal sorting on MIMD machines. The algorithm rst sorts the elements within each node using a serial sorting algorithm, then uses a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm on two general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics
سال: 2018
ISSN: 2218-2055,1812-5409
DOI: 10.17721/1812-5409.2018/4.13